automaton logic

См. также в других словарях:

• logic, philosophy of — Philosophical study of the nature and scope of logic. Examples of questions raised in the philosophy of logic are: In virtue of what features of reality are the laws of logic true? ; How do we know the truths of logic? ; and Could the laws of… …   Universalium

• Quantum dot cellular automaton — Quantum Dot Cellular Automata (sometimes referred to simply as quantum cellular automata, or QCA) Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must …   Wikipedia

• Pebble automaton — A pebble automaton is an extension of tree walking automata which allows the automaton to use a finite amount of pebbles , used for marking tree node. The result is a model stronger than ordinary tree walking automata, but still strictly weaker… …   Wikipedia

• Block cellular automaton — The Margolus neighborhood for a two dimensional block cellular automaton. The partition of the cells alternates between the set of 2 × 2 blocks indicated by the solid blue lines, and the set of blocks indicated by the dashed red lines. A block… …   Wikipedia

• Complementation of Büchi automaton — In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves …   Wikipedia

• ω-automaton — In automata theory, a branch of theoretical computer science, an ω automaton (or stream automaton) is a deterministic or nondeterministic automaton that runs on infinite, rather than finite, strings as input. Since ω automata do not stop, they… …   Wikipedia

• Linear temporal logic — (LTL) is a modal temporal logic with modalities referring to time. In LTL, one can encode formulae about the future of paths such as that a condition will eventually be true, that a condition will be true until another fact becomes true,… …   Wikipedia

• Muller automaton — In automata theory, a Muller automaton is a type of an ω automaton. The acceptance condition separates a Muller automomaton from other ω automata. The Muller automata is defined using Muller acceptance condition, i.e. the set of all states… …   Wikipedia

• Büchi automaton — A Büchi automaton is the extension of a finite state automaton to infinite inputs. It accepts an infinite input sequence iff there exists a run of the automaton (in case of a deterministic automaton, there is exactly one possible run) which… …   Wikipedia

• Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… …   Wikipedia

• Asynchronous cellular automaton — Cellular automata, as with other multi agent system models, usually treat time as discrete and state updates as occurring synchronously. The state of every cell in the model is updated together, before any of the new states influence other cells …   Wikipedia